OpenNWA: A Nested-Word Automaton Library
نویسندگان
چکیده
Nested-word automata (NWAs) are a language formalism that helps bridge the gap between finite-state automata and pushdown automata. NWAs can express some context-free properties, such as parenthesis matching, yet retain all the desirable closure characteristics of finite-state automata. This paper describes OpenNWA, a C++ library for working with NWAs. The library provides the expected automata-theoretic operations, such as intersection, determinization, and complementation. It is packaged with WALi—the W eighted Automaton Library—and interoperates closely with the weighted pushdown system portions of WALi.
منابع مشابه
WALi: Nested-Word Automata
WALi-NWA is a C++ library for constructing, querying, and operating on nested-word automata. It is a portion of the WALi library, which provides types and operations for weighted automata. While the NWA portions of WALi are mostly logically separate from the rest of WALi, it does use facilities provided by WALi and inter-operates with WALi’s weighted pushdown system (WPDS) code.
متن کاملOn Groups Whose Word Problem Is Solved by a Nested Stack Automaton
Accessible groups whose word problems are accepted by a deterministic nested stack automaton with limited erasing are virtually
متن کاملNondeterministic state complexity of nested word automata
We study the nondeterministic state complexity of Boolean operations on regular languages of nested words. For union and intersection we obtain matching upper and lower bounds. For complementation of a nondeterministic nested word automaton with n states we establish a lower boundΩ( √ n!) that is significantly worse than the exponential lower bound for ordinary nondeterministic finite automata ...
متن کاملAlternation Elimination for Automata over Nested Words
This paper presents constructions for translating alternating automata into nondeterministic nested-word automata (NWAs). With these alternation-elimination constructions at hand, we straightforwardly obtain translations from various temporal logics over nested words from the literature like CaRet and μNWTL, and extensions thereof to NWAs, which correct, simplify, improve, and generalize the pr...
متن کاملA Uniformization Theorem for Nested Word to Word Transductions
We study the class of relations implemented by nested word to word transducers (also known as visibly pushdown transducers). We show that any such relation can be uniformized by a functional relation from the same class, implemented by an unambiguous transducer. We give an exponential upper bound on the state complexity of the uniformization, improving a previous doubly exponential upper bound....
متن کامل